價格：免費
更新日期：2014-02-23
檔案大小：266k
目前版本：1
版本需求：Android 2.3 以上版本
官方網站：mailto:glaubosclimaco@gmail.com
The knapsack problem or rucksack problem is a problem in combinatorial optimization: Given a set of items, each with a mass and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items.
http://en.wikipedia.org/wiki/Knapsack_problem
Basically, its a solver for a variation of this problem, the knapsack 0/1 problem